On Embedding an Outer - Planar Graph in aPoint
نویسنده
چکیده
Given an n-vertex outer-planar graph G and a set P of n points in the plane, we present an O(n log 3 n) time and O(n) space algorithm to compute a straight-line embedding of G in P, improving upon the algorithm in GMPP91, CU96] that requires O(n 2) time. Our algorithm is near-optimal as there is an (n log n) lower bound for the problem BMS95]. We present a simpler O(nd) time and O(n) space algorithm to compute a straight-line embedding of G in P where log n d 2n is the length of the longest vertex disjoint path in the dual of G. Therefore, the time complexity of the simpler algorithm varies between O(n log n) and O(n 2) depending on the value of d. More eecient algorithms are presented for certain restricted cases. If the dual of G is a path, then an optimal (n log n) time algorithm is presented. If the given point set is in convex position then we show that O(n) time suuces.
منابع مشابه
Testing Full Outer-2-planarity in Linear Time
A graph is 1-planar, if it admits a 1-planar embedding, where each edge has at most one crossing. Unfortunately, testing 1-planarity of a graph is known as NP-complete. This paper considers the problem of testing 2-planarity of a graph, in particular,testing full outer-2planarity of a graph. A graph is fully-outer-2-planar, if it admits a fully-outer-2-planar embedding such that every vertex is...
متن کاملEnumerating Rooted Biconnected Planar Graphs with Internally Triangulated Faces
A graph is called a triangulated planar graph if it admits a plane embedding in the plane such that all inner faces are triangle. In a rooted triangulated planar graph, a vertex and two edges incident to it are designated as an outer vertex and outer edges, respectively. Two plane embedding of rooted triangulated planar graphs are defined to be equivalent if they admit an isomorphism such that ...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملAn Algorithm for Constructing a Planar Layout of a Graph with a Regular Polygon as Outer Face
Read’s algorithm for constructing a planar layout of a graph G produces a straight-line embedding of G, by using a sequence of triangulations. Let F denote any face of G. In this paper, Read’s algorithm is modified. A straight-line embedding is constructed in which F forms the outer face, such that its vertices lie on a convex regular polygon. It is proved that the method always works. Usually ...
متن کامل